Synchrophasors Determination Based on Interpolated FFT Algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Compression Based on Improved FFT Algorithm

Image compression is a crucial step in image processing area. Image Fourier transforms is the classical algorithm which can convert image from spatial domain to frequency domain. Because of its good concentrative property with transform energy, Fourier transform has been widely applied in image coding, image segmentation, image reconstruction. This paper adopts Radix-4 Fast Fourier transform (R...

متن کامل

New FFT structures based on the Bruun algorithm

In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the Discrete Fourier Transform (DFT) is attractive. This correspondence offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The parallel pipeline and recirculated FFT structures are implemented based on the modified perfect shuffle network.

متن کامل

Algorithm-Based Fault Tolerance for FFT Networks

Call packing has been recognized as a routing scheme thatsignificantly reduces the blocking probability of connection requests ina circuit-switched Clos multistage interconnection network. In this briefcontribution, for the first time, we develop general analytical models forthe point-to-point blocking probability of the call-packing scheme appliedto Clos networks. By introd...

متن کامل

A generalized FFT algorithm on transputers*

Abstract. A generalized algorithm has been derived for the execution of the CooleyTukey FFT algorithm on a distributed memory machine. This algorithm is based on an approach that combines a large number of butterfly operations into one large process per processor. The performance can be predicted from theory. The actual algorithm has been implemented on a transputer array, and the performance o...

متن کامل

Notes on FFT-based differentiation

A common numerical technique is to differentiate some sampled function y(x) via fast Fourier transforms (FFTs). Equivalently, one differentiates an approximate Fourier series. Equivalently, one differentiates a trigonometric interpolation. These are also known as spectral differentiation methods. However, the implementation of such methods is prey to common confusions due to the aliasing phenom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Energy - Energija

سال: 2020

ISSN: 1849-0751,0013-7448

DOI: 10.37798/202069133